#ifndef _LINUX_LIST_H
#define _LINUX_LIST_H

#ifdef _WIN32

#ifndef ARCH_HAS_PREFETCH
#define ARCH_HAS_PREFETCH
static void prefetch(const void *x) { ; }
#endif

#define container_of(ptr, type, member) ((type *)( (char *)(ptr) - offsetof(type,member) ))

struct list_head {
	struct list_head *next, *prev;
};

#define LIST_HEAD_INIT(name) { &(name), &(name) }

#define LIST_HEAD(name) \
	struct list_head name = LIST_HEAD_INIT(name)

static inline void INIT_LIST_HEAD(struct list_head *list)
{
	list->next = list;
	list->prev = list;
}

/*
 * Insert a nnew entry between two known consecutive entries.
 *
 * This is only for internal list manipulation where we know
 * the prev/next entries already!
 */
#ifndef CONFIG_DEBUG_LIST
static inline void __list_add(struct list_head *n,
	struct list_head *prev,
	struct list_head *next)
{
	next->prev = n;
	n->next = next;
	n->prev = prev;
	prev->next = n;
}
#else
extern void __list_add(struct list_head *nnew,
	struct list_head *prev,
	struct list_head *next);
#endif

/**
 * list_add - add a nnew entry
 * @nnew: nnew entry to be added
 * @head: list head to add it after
 *
 * Insert a nnew entry after the specified head.
 * This is good for implementing stacks.
 */
static inline void list_add(struct list_head *nnew, struct list_head *head)
{
	__list_add(nnew, head, head->next);
}


/**
 * list_add_tail - add a nnew entry
 * @nnew: nnew entry to be added
 * @head: list head to add it before
 *
 * Insert a nnew entry before the specified head.
 * This is useful for implementing queues.
 */
static inline void list_add_tail(struct list_head *nnew, struct list_head *head)
{
	__list_add(nnew, head->prev, head);
}

/*
 * Delete a list entry by making the prev/next entries
 * point to each other.
 *
 * This is only for internal list manipulation where we know
 * the prev/next entries already!
 */
static inline void __list_del(struct list_head * prev, struct list_head * next)
{
	next->prev = prev;
	prev->next = next;
}

/**
 * list_del - deletes entry from list.
 * @entry: the element to delete from the list.
 * Note: list_empty() on entry does not return true after this, the entry is
 * in an undefined state.
 */
static inline void list_del(struct list_head *entry)
{
	__list_del(entry->prev, entry->next);
}

/**
 * list_replace - replace old entry by nnew one
 * @old : the element to be replaced
 * @nnew : the nnew element to insert
 *
 * If @old was empty, it will be overwritten.
 */
static inline void list_replace(struct list_head *old,
	struct list_head *nnew)
{
	nnew->next = old->next;
	nnew->next->prev = nnew;
	nnew->prev = old->prev;
	nnew->prev->next = nnew;
}

static inline void list_replace_init(struct list_head *old,
	struct list_head *nnew)
{
	list_replace(old, nnew);
	INIT_LIST_HEAD(old);
}

/**
 * list_del_init - deletes entry from list and reinitialize it.
 * @entry: the element to delete from the list.
 */
static inline void list_del_init(struct list_head *entry)
{
	__list_del(entry->prev, entry->next);
	INIT_LIST_HEAD(entry);
}

/**
 * list_move - delete from one list and add as another's head
 * @list: the entry to move
 * @head: the head that will precede our entry
 */
static inline void list_move(struct list_head *list, struct list_head *head)
{
	__list_del(list->prev, list->next);
	list_add(list, head);
}

/**
 * list_move_tail - delete from one list and add as another's tail
 * @list: the entry to move
 * @head: the head that will follow our entry
 */
static inline void list_move_tail(struct list_head *list,
	struct list_head *head)
{
	__list_del(list->prev, list->next);
	list_add_tail(list, head);
}

/**
 * list_is_last - tests whether @list is the last entry in list @head
 * @list: the entry to test
 * @head: the head of the list
 */
static inline int list_is_last(const struct list_head *list,
	const struct list_head *head)
{
	return list->next == head;
}

/**
 * list_empty - tests whether a list is empty
 * @head: the list to test.
 */
static inline int list_empty(const struct list_head *head)
{
	return head->next == head;
}

/**
 * list_empty_careful - tests whether a list is empty and not being modified
 * @head: the list to test
 *
 * Description:
 * tests whether a list is empty _and_ checks that no other CPU might be
 * in the process of modifying either member (next or prev)
 *
 * NOTE: using list_empty_careful() without synchronization
 * can only be safe if the only activity that can happen
 * to the list entry is list_del_init(). Eg. it cannot be used
 * if another CPU could re-list_add() it.
 */
static inline int list_empty_careful(const struct list_head *head)
{
	struct list_head *next = head->next;
	return (next == head) && (next == head->prev);
}

/**
 * list_is_singular - tests whether a list has just one entry.
 * @head: the list to test.
 */
static inline int list_is_singular(const struct list_head *head)
{
	return !list_empty(head) && (head->next == head->prev);
}

static inline void __list_cut_position(struct list_head *list,
	struct list_head *head, struct list_head *entry)
{
	struct list_head *nnew_first = entry->next;
	list->next = head->next;
	list->next->prev = list;
	list->prev = entry;
	entry->next = list;
	head->next = nnew_first;
	nnew_first->prev = head;
}

/**
 * list_cut_position - cut a list into two
 * @list: a nnew list to add all removed entries
 * @head: a list with entries
 * @entry: an entry within head, could be the head itself
 *	and if so we won't cut the list
 *
 * This helper moves the initial part of @head, up to and
 * including @entry, from @head to @list. You should
 * pass on @entry an element you know is on @head. @list
 * should be an empty list or a list you do not care about
 * losing its data.
 *
 */
static inline void list_cut_position(struct list_head *list,
	struct list_head *head, struct list_head *entry)
{
	if (list_empty(head))
		return;
	if (list_is_singular(head) &&
		(head->next != entry && head != entry))
		return;
	if (entry == head)
		INIT_LIST_HEAD(list);
	else
		__list_cut_position(list, head, entry);
}

static inline void __list_splice(const struct list_head *list,
	struct list_head *prev,
	struct list_head *next)
{
	struct list_head *first = list->next;
	struct list_head *last = list->prev;

	first->prev = prev;
	prev->next = first;

	last->next = next;
	next->prev = last;
}

/**
 * list_splice - join two lists, this is designed for stacks
 * @list: the nnew list to add.
 * @head: the place to add it in the first list.
 */
static inline void list_splice(const struct list_head *list,
	struct list_head *head)
{
	if (!list_empty(list))
		__list_splice(list, head, head->next);
}

/**
 * list_splice_tail - join two lists, each list being a queue
 * @list: the nnew list to add.
 * @head: the place to add it in the first list.
 */
static inline void list_splice_tail(struct list_head *list,
	struct list_head *head)
{
	if (!list_empty(list))
		__list_splice(list, head->prev, head);
}

/**
 * list_splice_init - join two lists and reinitialise the emptied list.
 * @list: the nnew list to add.
 * @head: the place to add it in the first list.
 *
 * The list at @list is reinitialised
 */
static inline void list_splice_init(struct list_head *list,
	struct list_head *head)
{
	if (!list_empty(list)) {
		__list_splice(list, head, head->next);
		INIT_LIST_HEAD(list);
	}
}

/**
 * list_splice_tail_init - join two lists and reinitialise the emptied list
 * @list: the nnew list to add.
 * @head: the place to add it in the first list.
 *
 * Each of the lists is a queue.
 * The list at @list is reinitialised
 */
static inline void list_splice_tail_init(struct list_head *list,
	struct list_head *head)
{
	if (!list_empty(list)) {
		__list_splice(list, head->prev, head);
		INIT_LIST_HEAD(list);
	}
}

/**
 * list_entry - get the struct for this entry
 * @ptr:	the &struct list_head pointer.
 * @type:	the type of the struct this is embedded in.
 * @member:	the name of the list_struct within the struct.
 */
#define list_entry(ptr, type, member) \
	container_of(ptr, type, member)

 /**
  * list_first_entry - get the first element from a list
  * @ptr:	the list head to take the element from.
  * @type:	the type of the struct this is embedded in.
  * @member:	the name of the list_struct within the struct.
  *
  * Note, that list is expected to be not empty.
  */
#define list_first_entry(ptr, type, member) \
	list_entry((ptr)->next, type, member)

  /**
   * list_for_each	-	iterate over a list
   * @pos:	the &struct list_head to use as a loop cursor.
   * @head:	the head for your list.
   */
#if 0
#define list_for_each(pos, head) \
	for (pos = (head)->next; pos != (head); \
        	pos = pos->next)
#else
#define list_for_each(pos, head) \
    for (pos = (head)->next; prefetch(pos->next), pos != (head); \
        pos = pos->next)
#endif
   /**
	* __list_for_each	-	iterate over a list
	* @pos:	the &struct list_head to use as a loop cursor.
	* @head:	the head for your list.
	*
	* This variant differs from list_for_each() in that it's the
	* simplest possible list iteration code, no prefetching is done.
	* Use this for code that knows the list to be very short (empty
	* or 1 entry) most of the time.
	*/
#define __list_for_each(pos, head) \
	for (pos = (head)->next; pos != (head); pos = pos->next)

	/**
	 * list_for_each_prev	-	iterate over a list backwards
	 * @pos:	the &struct list_head to use as a loop cursor.
	 * @head:	the head for your list.
	 */
#define list_for_each_prev(pos, head) \
	for (pos = (head)->prev; pos != (head); \
        	pos = pos->prev)

	 /**
	  * list_for_each_safe - iterate over a list safe against removal of list entry
	  * @pos:	the &struct list_head to use as a loop cursor.
	  * @n:		another &struct list_head to use as temporary storage
	  * @head:	the head for your list.
	  */
#define list_for_each_safe(pos, n, head) \
	for (pos = (head)->next, n = pos->next; pos != (head); \
		pos = n, n = pos->next)

	  /**
	   * list_for_each_prev_safe - iterate over a list backwards safe against removal of list entry
	   * @pos:	the &struct list_head to use as a loop cursor.
	   * @n:		another &struct list_head to use as temporary storage
	   * @head:	the head for your list.
	   */
#define list_for_each_prev_safe(pos, n, head) \
	for (pos = (head)->prev, n = pos->prev; \
	     pos != (head); \
	     pos = n, n = pos->prev)

	   /**
		* list_for_each_entry	-	iterate over list of given type
		* @pos:	the type * to use as a loop cursor.
		* @head:	the head for your list.
		* @member:	the name of the list_struct within the struct.
		*/
#define list_for_each_entry(pos, head, member, type)				\
	for (pos = list_entry((head)->next, type, member);	\
	     &pos->member != (head); 	\
	     pos = list_entry(pos->member.next, type, member))

		/**
		 * list_for_each_entry_reverse - iterate backwards over list of given type.
		 * @pos:	the type * to use as a loop cursor.
		 * @head:	the head for your list.
		 * @member:	the name of the list_struct within the struct.
		 */
#define list_for_each_entry_reverse(pos, head, member, type)			\
	for (pos = list_entry((head)->prev, type, member);	\
	     &pos->member != (head); 	\
	     pos = list_entry(pos->member.prev, type, member))

		 /**
		  * list_prepare_entry - prepare a pos entry for use in list_for_each_entry_continue()
		  * @pos:	the type * to use as a start point
		  * @head:	the head of the list
		  * @member:	the name of the list_struct within the struct.
		  *
		  * Prepares a pos entry for use as a start point in list_for_each_entry_continue().
		  */
#define list_prepare_entry(pos, head, member, type) \
	((pos) ? : list_entry(head, type, member))

		  /**
		   * list_for_each_entry_continue - continue iteration over list of given type
		   * @pos:	the type * to use as a loop cursor.
		   * @head:	the head for your list.
		   * @member:	the name of the list_struct within the struct.
		   *
		   * Continue to iterate over list of given type, continuing after
		   * the current position.
		   */
#define list_for_each_entry_continue(pos, head, member, type) 		\
	for (pos = list_entry(pos->member.next, type, member);	\
	     &pos->member != (head);	\
	     pos = list_entry(pos->member.next, type, member))

		   /**
			* list_for_each_entry_continue_reverse - iterate backwards from the given point
			* @pos:	the type * to use as a loop cursor.
			* @head:	the head for your list.
			* @member:	the name of the list_struct within the struct.
			*
			* Start to iterate over list of given type backwards, continuing after
			* the current position.
			*/
#define list_for_each_entry_continue_reverse(pos, head, member)		\
	for (pos = list_entry(pos->member.prev, type, member);	\
	     &pos->member != (head);	\
	     pos = list_entry(pos->member.prev, type, member))

			/**
			 * list_for_each_entry_from - iterate over list of given type from the current point
			 * @pos:	the type * to use as a loop cursor.
			 * @head:	the head for your list.
			 * @member:	the name of the list_struct within the struct.
			 *
			 * Iterate over list of given type, continuing from current position.
			 */
#define list_for_each_entry_from(pos, head, member, type) 			\
	for (; &pos->member != (head);	\
	     pos = list_entry(pos->member.next, type, member))

			 /**
			  * list_for_each_entry_safe - iterate over list of given type safe against removal of list entry
			  * @pos:	the type * to use as a loop cursor.
			  * @n:		another type * to use as temporary storage
			  * @head:	the head for your list.
			  * @member:	the name of the list_struct within the struct.
			  */
#define list_for_each_entry_safe(pos, n, head, member, type)			\
	for (pos = list_entry((head)->next, type, member),	\
		n = list_entry(pos->member.next, type, member);	\
	     &pos->member != (head); 					\
	     pos = n, n = list_entry(n->member.next, type, member))

			  /**
			   * list_for_each_entry_safe_continue
			   * @pos:	the type * to use as a loop cursor.
			   * @n:		another type * to use as temporary storage
			   * @head:	the head for your list.
			   * @member:	the name of the list_struct within the struct.
			   *
			   * Iterate over list of given type, continuing after current point,
			   * safe against removal of list entry.
			   */
#define list_for_each_entry_safe_continue(pos, n, head, member, type) 		\
	for (pos = list_entry(pos->member.next, type, member), 		\
		n = list_entry(pos->member.next, type, member);		\
	     &pos->member != (head);						\
	     pos = n, n = list_entry(n->member.next, type, member))

			   /**
				* list_for_each_entry_safe_from
				* @pos:	the type * to use as a loop cursor.
				* @n:		another type * to use as temporary storage
				* @head:	the head for your list.
				* @member:	the name of the list_struct within the struct.
				*
				* Iterate over list of given type from current point, safe against
				* removal of list entry.
				*/
#define list_for_each_entry_safe_from(pos, n, head, member, type) 			\
	for (n = list_entry(pos->member.next, type, member);		\
	     &pos->member != (head);						\
	     pos = n, n = list_entry(n->member.next, type, member))

				/**
				 * list_for_each_entry_safe_reverse
				 * @pos:	the type * to use as a loop cursor.
				 * @n:		another type * to use as temporary storage
				 * @head:	the head for your list.
				 * @member:	the name of the list_struct within the struct.
				 *
				 * Iterate backwards over list of given type, safe against removal
				 * of list entry.
				 */
#define list_for_each_entry_safe_reverse(pos, n, head, member, type)		\
	for (pos = list_entry((head)->prev, type, member),	\
		n = list_entry(pos->member.prev, type, member);	\
	     &pos->member != (head); 					\
	     pos = n, n = list_entry(n->member.prev, type, member))


#else


/*
 * Simple doubly linked list implementation.
 *
 * Some of the internal functions ("__xxx") are useful when
 * manipulating whole lists rather than single entries, as
 * sometimes we already know the next/prev entries and we can
 * generate better code by using them directly rather than
 * using the generic single-entry routines.
 */
#undef offsetof
#ifdef __compiler_offsetof
#define offsetof(TYPE,MEMBER) __compiler_offsetof(TYPE,MEMBER)
#else
#define offsetof(TYPE, MEMBER) ((size_t) &((TYPE *)0)->MEMBER)
#endif

#define container_of(ptr, type, member) ({			\
	const typeof( ((type *)0)->member ) *__mptr = (ptr);	\
	(type *)( (char *)__mptr - offsetof(type,member) );})


struct list_head {
	struct list_head *next, *prev;
};

#define LIST_HEAD_INIT(name) { &(name), &(name) }

#define LIST_HEAD(name) \
	struct list_head name = LIST_HEAD_INIT(name)

static inline void INIT_LIST_HEAD(struct list_head *list)
{
	list->next = list;
	list->prev = list;
}

/*
 * Insert a newnode entry between two known consecutive entries.
 *
 * This is only for internal list manipulation where we know
 * the prev/next entries already!
 */
#ifndef CONFIG_DEBUG_LIST
static inline void __list_add(struct list_head *newnode,
	struct list_head *prev,
	struct list_head *next)
{
	next->prev = newnode;
	newnode->next = next;
	newnode->prev = prev;
	prev->next = newnode;
}
#else
extern void __list_add(struct list_head *newnode,
	struct list_head *prev,
	struct list_head *next);
#endif

/**
 * list_add - add a newnode entry
 * @newnode: newnode entry to be added
 * @head: list head to add it after
 *
 * Insert a newnode entry after the specified head.
 * This is good for implementing stacks.
 */
static inline void list_add(struct list_head *newnode, struct list_head *head)
{
	__list_add(newnode, head, head->next);
}

static inline void list_add_before(struct list_head *newnode, struct list_head *head)
{
	__list_add(newnode, head->prev, head);
}


/**
 * list_add_tail - add a newnode entry
 * @newnode: newnode entry to be added
 * @head: list head to add it before
 *
 * Insert a newnode entry before the specified head.
 * This is useful for implementing queues.
 */
static inline void list_add_tail(struct list_head *newnode, struct list_head *head)
{
	__list_add(newnode, head->prev, head);
}

/*
 * Delete a list entry by making the prev/next entries
 * point to each other.
 *
 * This is only for internal list manipulation where we know
 * the prev/next entries already!
 */
static inline void __list_del(struct list_head * prev, struct list_head * next)
{
	next->prev = prev;
	prev->next = next;
}

/**
 * list_del - deletes entry from list.
 * @entry: the element to delete from the list.
 * Note: list_empty() on entry does not return true after this, the entry is
 * in an undefined state.
 */
static inline void list_del(struct list_head *entry)
{
	__list_del(entry->prev, entry->next);
}

/**
 * list_replace - replace old entry by newnode one
 * @old : the element to be replaced
 * @newnode : the newnode element to insert
 *
 * If @old was empty, it will be overwritten.
 */
static inline void list_replace(struct list_head *old,
	struct list_head *newnode)
{
	newnode->next = old->next;
	newnode->next->prev = newnode;
	newnode->prev = old->prev;
	newnode->prev->next = newnode;
}

static inline void list_replace_init(struct list_head *old,
	struct list_head *newnode)
{
	list_replace(old, newnode);
	INIT_LIST_HEAD(old);
}

/**
 * list_del_init - deletes entry from list and reinitialize it.
 * @entry: the element to delete from the list.
 */
static inline void list_del_init(struct list_head *entry)
{
	__list_del(entry->prev, entry->next);
	INIT_LIST_HEAD(entry);
}

/**
 * list_move - delete from one list and add as another's head
 * @list: the entry to move
 * @head: the head that will precede our entry
 */
static inline void list_move(struct list_head *list, struct list_head *head)
{
	__list_del(list->prev, list->next);
	list_add(list, head);
}

/**
 * list_move_tail - delete from one list and add as another's tail
 * @list: the entry to move
 * @head: the head that will follow our entry
 */
static inline void list_move_tail(struct list_head *list,
	struct list_head *head)
{
	__list_del(list->prev, list->next);
	list_add_tail(list, head);
}

/**
 * list_is_last - tests whether @list is the last entry in list @head
 * @list: the entry to test
 * @head: the head of the list
 */
static inline int list_is_last(const struct list_head *list,
	const struct list_head *head)
{
	return list->next == head;
}

/**
 * list_empty - tests whether a list is empty
 * @head: the list to test.
 */
static inline int list_empty(const struct list_head *head)
{
	return head->next == head;
}

/**
 * list_empty_careful - tests whether a list is empty and not being modified
 * @head: the list to test
 *
 * Description:
 * tests whether a list is empty _and_ checks that no other CPU might be
 * in the process of modifying either member (next or prev)
 *
 * NOTE: using list_empty_careful() without synchronization
 * can only be safe if the only activity that can happen
 * to the list entry is list_del_init(). Eg. it cannot be used
 * if another CPU could re-list_add() it.
 */
static inline int list_empty_careful(const struct list_head *head)
{
	struct list_head *next = head->next;
	return (next == head) && (next == head->prev);
}

/**
 * list_is_singular - tests whether a list has just one entry.
 * @head: the list to test.
 */
static inline int list_is_singular(const struct list_head *head)
{
	return !list_empty(head) && (head->next == head->prev);
}

static inline void __list_cut_position(struct list_head *list,
	struct list_head *head, struct list_head *entry)
{
	struct list_head *newnode_first = entry->next;
	list->next = head->next;
	list->next->prev = list;
	list->prev = entry;
	entry->next = list;
	head->next = newnode_first;
	newnode_first->prev = head;
}

/**
 * list_cut_position - cut a list into two
 * @list: a newnode list to add all removed entries
 * @head: a list with entries
 * @entry: an entry within head, could be the head itself
 *	and if so we won't cut the list
 *
 * This helper moves the initial part of @head, up to and
 * including @entry, from @head to @list. You should
 * pass on @entry an element you know is on @head. @list
 * should be an empty list or a list you do not care about
 * losing its data.
 *
 */
static inline void list_cut_position(struct list_head *list,
	struct list_head *head, struct list_head *entry)
{
	if (list_empty(head))
		return;
	if (list_is_singular(head) &&
		(head->next != entry && head != entry))
		return;
	if (entry == head)
		INIT_LIST_HEAD(list);
	else
		__list_cut_position(list, head, entry);
}

static inline void __list_splice(const struct list_head *list,
	struct list_head *prev,
	struct list_head *next)
{
	struct list_head *first = list->next;
	struct list_head *last = list->prev;

	first->prev = prev;
	prev->next = first;

	last->next = next;
	next->prev = last;
}

/**
 * list_splice - join two lists, this is designed for stacks
 * @list: the newnode list to add.
 * @head: the place to add it in the first list.
 */
static inline void list_splice(const struct list_head *list,
	struct list_head *head)
{
	if (!list_empty(list))
		__list_splice(list, head, head->next);
}

/**
 * list_splice_tail - join two lists, each list being a queue
 * @list: the newnode list to add.
 * @head: the place to add it in the first list.
 */
static inline void list_splice_tail(struct list_head *list,
	struct list_head *head)
{
	if (!list_empty(list))
		__list_splice(list, head->prev, head);
}

/**
 * list_splice_init - join two lists and reinitialise the emptied list.
 * @list: the newnode list to add.
 * @head: the place to add it in the first list.
 *
 * The list at @list is reinitialised
 */
static inline void list_splice_init(struct list_head *list,
	struct list_head *head)
{
	if (!list_empty(list)) {
		__list_splice(list, head, head->next);
		INIT_LIST_HEAD(list);
	}
}

/**
 * list_splice_tail_init - join two lists and reinitialise the emptied list
 * @list: the newnode list to add.
 * @head: the place to add it in the first list.
 *
 * Each of the lists is a queue.
 * The list at @list is reinitialised
 */
static inline void list_splice_tail_init(struct list_head *list,
	struct list_head *head)
{
	if (!list_empty(list)) {
		__list_splice(list, head->prev, head);
		INIT_LIST_HEAD(list);
	}
}

/**
 * list_entry - get the struct for this entry
 * @ptr:	the &struct list_head pointer.
 * @type:	the type of the struct this is embedded in.
 * @member:	the name of the list_struct within the struct.
 */
#define list_entry(ptr, type, member) \
	container_of(ptr, type, member)

 /**
  * list_first_entry - get the first element from a list
  * @ptr:	the list head to take the element from.
  * @type:	the type of the struct this is embedded in.
  * @member:	the name of the list_struct within the struct.
  *
  * Note, that list is expected to be not empty.
  */
#define list_first_entry(ptr, type, member) \
	list_entry((ptr)->next, type, member)

  /**
   * list_for_each	-	iterate over a list
   * @pos:	the &struct list_head to use as a loop cursor.
   * @head:	the head for your list.
   */
#define list_for_each(pos, head) \
	for (pos = (head)->next; pos != (head); \
        	pos = pos->next)

   /**
	* __list_for_each	-	iterate over a list
	* @pos:	the &struct list_head to use as a loop cursor.
	* @head:	the head for your list.
	*
	* This variant differs from list_for_each() in that it's the
	* simplest possible list iteration code, no prefetching is done.
	* Use this for code that knows the list to be very short (empty
	* or 1 entry) most of the time.
	*/
#define __list_for_each(pos, head) \
	for (pos = (head)->next; pos != (head); pos = pos->next)

	/**
	 * list_for_each_prev	-	iterate over a list backwards
	 * @pos:	the &struct list_head to use as a loop cursor.
	 * @head:	the head for your list.
	 */
#define list_for_each_prev(pos, head) \
	for (pos = (head)->prev; pos != (head); \
        	pos = pos->prev)

	 /**
	  * list_for_each_safe - iterate over a list safe against removal of list entry
	  * @pos:	the &struct list_head to use as a loop cursor.
	  * @n:		another &struct list_head to use as temporary storage
	  * @head:	the head for your list.
	  */
#define list_for_each_safe(pos, n, head) \
	for (pos = (head)->next, n = pos->next; pos != (head); \
		pos = n, n = pos->next)

	  /**
	   * list_for_each_prev_safe - iterate over a list backwards safe against removal of list entry
	   * @pos:	the &struct list_head to use as a loop cursor.
	   * @n:		another &struct list_head to use as temporary storage
	   * @head:	the head for your list.
	   */
#define list_for_each_prev_safe(pos, n, head) \
	for (pos = (head)->prev, n = pos->prev; \
	     pos != (head); \
	     pos = n, n = pos->prev)

	   /**
		* list_for_each_entry	-	iterate over list of given type
		* @pos:	the type * to use as a loop cursor.
		* @head:	the head for your list.
		* @member:	the name of the list_struct within the struct.
		*/
#define list_for_each_entry(pos, head, member)				\
	for (pos = list_entry((head)->next, typeof(*pos), member);	\
	     &pos->member != (head); 	\
	     pos = list_entry(pos->member.next, typeof(*pos), member))

		/**
		 * list_for_each_entry_reverse - iterate backwards over list of given type.
		 * @pos:	the type * to use as a loop cursor.
		 * @head:	the head for your list.
		 * @member:	the name of the list_struct within the struct.
		 */
#define list_for_each_entry_reverse(pos, head, member)			\
	for (pos = list_entry((head)->prev, typeof(*pos), member);	\
	     &pos->member != (head); 	\
	     pos = list_entry(pos->member.prev, typeof(*pos), member))

		 /**
		  * list_prepare_entry - prepare a pos entry for use in list_for_each_entry_continue()
		  * @pos:	the type * to use as a start point
		  * @head:	the head of the list
		  * @member:	the name of the list_struct within the struct.
		  *
		  * Prepares a pos entry for use as a start point in list_for_each_entry_continue().
		  */
#define list_prepare_entry(pos, head, member) \
	((pos) ? : list_entry(head, typeof(*pos), member))

		  /**
		   * list_for_each_entry_continue - continue iteration over list of given type
		   * @pos:	the type * to use as a loop cursor.
		   * @head:	the head for your list.
		   * @member:	the name of the list_struct within the struct.
		   *
		   * Continue to iterate over list of given type, continuing after
		   * the current position.
		   */
#define list_for_each_entry_continue(pos, head, member) 		\
	for (pos = list_entry(pos->member.next, typeof(*pos), member);	\
	     &pos->member != (head);	\
	     pos = list_entry(pos->member.next, typeof(*pos), member))

		   /**
			* list_for_each_entry_continue_reverse - iterate backwards from the given point
			* @pos:	the type * to use as a loop cursor.
			* @head:	the head for your list.
			* @member:	the name of the list_struct within the struct.
			*
			* Start to iterate over list of given type backwards, continuing after
			* the current position.
			*/
#define list_for_each_entry_continue_reverse(pos, head, member)		\
	for (pos = list_entry(pos->member.prev, typeof(*pos), member);	\
	     &pos->member != (head);	\
	     pos = list_entry(pos->member.prev, typeof(*pos), member))

			/**
			 * list_for_each_entry_from - iterate over list of given type from the current point
			 * @pos:	the type * to use as a loop cursor.
			 * @head:	the head for your list.
			 * @member:	the name of the list_struct within the struct.
			 *
			 * Iterate over list of given type, continuing from current position.
			 */
#define list_for_each_entry_from(pos, head, member) 			\
	for (; &pos->member != (head);	\
	     pos = list_entry(pos->member.next, typeof(*pos), member))

			 /**
			  * list_for_each_entry_safe - iterate over list of given type safe against removal of list entry
			  * @pos:	the type * to use as a loop cursor.
			  * @n:		another type * to use as temporary storage
			  * @head:	the head for your list.
			  * @member:	the name of the list_struct within the struct.
			  */
#define list_for_each_entry_safe(pos, n, head, member)			\
	for (pos = list_entry((head)->next, typeof(*pos), member),	\
		n = list_entry(pos->member.next, typeof(*pos), member);	\
	     &pos->member != (head); 					\
	     pos = n, n = list_entry(n->member.next, typeof(*n), member))

			  /**
			   * list_for_each_entry_safe_continue
			   * @pos:	the type * to use as a loop cursor.
			   * @n:		another type * to use as temporary storage
			   * @head:	the head for your list.
			   * @member:	the name of the list_struct within the struct.
			   *
			   * Iterate over list of given type, continuing after current point,
			   * safe against removal of list entry.
			   */
#define list_for_each_entry_safe_continue(pos, n, head, member) 		\
	for (pos = list_entry(pos->member.next, typeof(*pos), member), 		\
		n = list_entry(pos->member.next, typeof(*pos), member);		\
	     &pos->member != (head);						\
	     pos = n, n = list_entry(n->member.next, typeof(*n), member))

			   /**
				* list_for_each_entry_safe_from
				* @pos:	the type * to use as a loop cursor.
				* @n:		another type * to use as temporary storage
				* @head:	the head for your list.
				* @member:	the name of the list_struct within the struct.
				*
				* Iterate over list of given type from current point, safe against
				* removal of list entry.
				*/
#define list_for_each_entry_safe_from(pos, n, head, member) 			\
	for (n = list_entry(pos->member.next, typeof(*pos), member);		\
	     &pos->member != (head);						\
	     pos = n, n = list_entry(n->member.next, typeof(*n), member))

				/**
				 * list_for_each_entry_safe_reverse
				 * @pos:	the type * to use as a loop cursor.
				 * @n:		another type * to use as temporary storage
				 * @head:	the head for your list.
				 * @member:	the name of the list_struct within the struct.
				 *
				 * Iterate backwards over list of given type, safe against removal
				 * of list entry.
				 */
#define list_for_each_entry_safe_reverse(pos, n, head, member)		\
	for (pos = list_entry((head)->prev, typeof(*pos), member),	\
		n = list_entry(pos->member.prev, typeof(*pos), member);	\
	     &pos->member != (head); 					\
	     pos = n, n = list_entry(n->member.prev, typeof(*n), member))

#endif //_WIN32

#endif//_LIST_H
